Open Implication
نویسندگان
چکیده
We argue that the usual trace-based notions of implication and equivalence for linear temporal logics are too strong and should be complemented by the weaker notions of open implication and open equivalence. Although open implication is harder to compute, it can be used to advantage both in model checking and in synthesis. We study the difference between trace-based equivalence and open equivalence and describe an algorithm to compute open implication of Linear Temporal Logic formulas with an asymptotically optimal complexity. We also show how to compute open implication while avoiding Safra’s construction. We have implemented an open-implication solver for Generalized Reactivity(1) specifications. In a case study, we show that open equivalence can be used to justify the use of an alternative specification that allows us to synthesize much smaller systems in far less time.
منابع مشابه
Open Implication A New Relation on Specifications Given in Linear Temporal Logic
The wish to automatically construct correct systems from specifications has been around for about half a century. Church was the first one to describe this idea in 1962. Our work is closely related to this idea. We will consider systems which react to the environment denoted as open modules and our specification language is linear temporal logic (LTL). Synthesis is the problem of automatically ...
متن کاملHistorical Analyzing of Reconceptualism: implication and intentions related to it in Curriculum Field
This paper conducts a historical analysis of the meaning and aims Reconceptualism in viewpoint of Pinar et al, including methodology and critics related to it in curriculum field from 1960s to 2010s. For this means, 25 papers and 4 books of Pinar et al were studied by methods of document and textual analysis through an analytical-critical approach. Critiques of Wraga and Hlebowitsh as alternat...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملDegree of F-irresolute function in (L, M)-fuzzy topological spaces
In this paper, we present a new vision for studying ${F}$-open, ${F}$-continuous, and ${F}$-irresolute function in $(L,M)$-fuzzy topological spaces based on the implication operation and $(L,M)$-fuzzy ${F}$-open operator cite{2}. These kinds of functions are generalized with their elementary properties to $(L,M)$-fuzzy topological spaces setting based on graded concepts. Moreover, a systematic ...
متن کاملContinuous R-Implications
In this work we have solved an open problem related to the continuity of R-implications. We have fully characterized the class of continuous R-implications obtained from any arbitrary t-norm. Using this result, we also determine the exact intersection between the continuous subsets of R-implications and (S,N)implications. Keywords— R-implication, (S,N)-implication, Łukasiewicz implication, t-norm.
متن کامل